A definable number which cannot be approximated algorithmically
نویسنده
چکیده
The Turing machine (TM) and the Church thesis have formalized the concept of computable number, this allowed to display noncomputable numbers. This paper defines the concept of number “approachable” by a TM and shows that some (if not all) known non-computable numbers are approachable by TMs. Then an example of a number not approachable by a TM is given.
منابع مشابه
Under Physics-Motivated Constraints, Generally-Non-Algorithmic Computational Problems become Algorithmically Solvable
It is well known that many computational problems are, in general, not algorithmically solvable: e.g., it is not possible to algorithmically decide whether two computable real numbers are equal, and it is not possible to compute the roots of a computable function. We propose to constraint such operations to certain “sets of typical elements” or “sets of random elements”. In our previous papers,...
متن کاملDeciding the Topological Complexity of Büchi Languages
We study the topological complexity of languages of Büchi automata on infinite binary trees. We show that such a language is either Borel and WMSO-definable, or Σ1-complete and not WMSO-definable; moreover it can be algorithmically decided which of the two cases holds. The proof relies on a direct reduction to deciding the winner in a finite game with a regular winning condition. 1998 ACM Subje...
متن کاملNegative Results of Computable Analysis Disappear If We Restrict Ourselves to Random (Or, More Generally, Typical) Inputs
It is well known that many computational problems are, in general, not algorithmically solvable: e.g., it is not possible to algorithmically decide whether two computable real numbers are equal, and it is not possible to compute the roots of a computable function. We propose to constraint such operations to certain “sets of typical elements” or “sets of random elements”. In our previous papers,...
متن کاملAre There Any Good Digraph Width Measures?
Several different measures for digraph width have appeared in the last few years. However, none of them shares all the “nice” properties of treewidth: First, being algorithmically useful i.e. admitting polynomial-time algorithms for all MSO1-definable problems on digraphs of bounded width. And, second, having nice structural properties i.e. being monotone under taking subdigraphs and some form ...
متن کاملA Two Level Approximation Technique for Structural Optimization
This work presents a method for optimum design of structures, where the design variables can he considered as Continuous or discrete. The variables are chosen as sizing variables as well as coordinates of joints. The main idea is to reduce the number of structural analyses and the overal cost of optimization. In each design cycle, first the structural response quantities such as forces, displac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1003.0480 شماره
صفحات -
تاریخ انتشار 2010